A NOTE ON QUASI-*-INVERTIBLE AND *-INVERTIBLE IDEALS
نویسندگان
چکیده
منابع مشابه
Factoring Nonnil Ideals into Prime and Invertible Ideals
For a commutative ring R, let Nil(R) be the set of all nilpotent elements of R, Z(R) be the set of all zero divisors of R, T (R) be the total quotient ring of R, and H = {R | R is a commutative ring and Nil(R) is a divided prime ideal of R}. For a ring R ∈ H, let φ : T (R) −→ RNil(R) such that φ(a/b) = a/b for every a ∈ R and b ∈ R\Z(R). A ring R is called a ZPUI ring if every proper ideal of R...
متن کاملA Note on Mixing Properties of Invertible Extensions
The natural invertible extension T̃ of an Nd-action T has been studied by Lacroix. He showed that T̃ may fail to be mixing even if T is mixing for d ≥ 2. We extend this observation by showing that if T is mixing on (k+ 1) sets then T̃ is in general mixing on no more than k sets, simply because Nd has a corner. Several examples are constructed when d = 2: (i) a mixing T for which T̃ (n,m) has an ide...
متن کاملInvertible Classes
This paper considers when one can invert general recursive operators which map a class of functions F to F . In this regard, we study four different notions of inversion. We additionally consider enumeration of operators which cover all general recursive operators which map F to F in the sense that for every general recursive operator Ψ mapping F to F , there is a general recursive operator in ...
متن کاملIterating Invertible Binary Transducers
We study iterated transductions defined by a class of invertible transducers over the binary alphabet. The transduction semigroups of these automata turn out to be free Abelian groups and the orbits of finite words can be described as affine subspaces in a suitable geometry defined by the generators of these groups. We show that iterated transductions are rational for a subclass of our automata.
متن کاملInvertible calculation's non-invertibility
In cryptosystem theory, it is well-known that a logical mapping that returns the same value that was used as its argument can be inverted with a zero failure probability in linear time. In this paper, however, I show that such a mapping, while trivially assigning a logical state to itself, comes up against an impassable entropy wall such that its computational path is undone inside the threshol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Chungcheong Mathematical Society
سال: 2013
ISSN: 1226-3524
DOI: 10.14403/jcms.2013.26.4.781